- Hall theorem
- теорема f Холла
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
Hall's marriage theorem — In mathematics, Hall s marriage theorem is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of finite sets. It was proved by Philip Hall (1935). Contents 1 Definitions and … Wikipedia
Hall subgroup — In mathematics, a Hall subgroup of a finite group G is a subgroup whose order is coprime to its index. They are named after the group theorist Philip Hall. Definitions A Hall divisor of an integer n is a divisor d of n such that d and n / d are… … Wikipedia
Theorem of corresponding states — The theorem of corresponding states originated with the work of Johannes Diderik van der Waals in about 1873 [ [http://digital.library.okstate.edu/oas/oas pdf/v56/p125 132.pdf A Four Parameter Corresponding States Correlation for Fluid… … Wikipedia
Hall's universal group — In algebra, Hall s universal group isa countable locally finite group, say U , which is uniquely characterized by the following properties.* Every finite group G admits a monomorphism to U .* All such monomorphisms are conjugate by inner… … Wikipedia
Marriage theorem — In mathematics, the marriage theorem (1935), usually credited to mathematician Philip Hall, is a combinatorial result that gives the condition allowing the selection of a distinct element from each of a collection of subsets.Formally, let S = { S … Wikipedia
Feit–Thompson theorem — In mathematics, the Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by Walter Feit and John Griggs Thompson (1962, 1963) Contents 1 History 2 Significance of the proof … Wikipedia
Focal subgroup theorem — In abstract algebra, the focal subgroup theorem describes the fusion of elements in a Sylow subgroup of a finite group. The focal subgroup theorem was introduced in (Higman 1958) and is the first major application of the transfer according to… … Wikipedia
Monty Hall problem — In search of a new car, the player picks a door, say 1. The game host then opens one of the other doors, say 3, to reveal a goat and offers to let the player pick door 2 instead of door 1. The Monty Hall problem is a probability puzzle loosely… … Wikipedia
Newton's theorem of revolving orbits — Figure 1: An attractive force F(r) causes the blue planet to move on the cyan circle. The green planet moves three times faster and thus requires a stronger centripetal force, which is supplied by adding an attractive inverse cube force. The … Wikipedia
Bayes' theorem — In probability theory, Bayes theorem (often called Bayes law after Thomas Bayes) relates the conditional and marginal probabilities of two random events. It is often used to compute posterior probabilities given observations. For example, a… … Wikipedia
Parseval's theorem — In mathematics, Parseval s theorem [Parseval des Chênes, Marc Antoine Mémoire sur les séries et sur l intégration complète d une équation aux differences partielle linéaire du second ordre, à coefficiens constans presented before the Académie des … Wikipedia